'Weak Dependency Graph [60.0]'
------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost runtime-complexity with respect to
Rules:
{ a(a(x1)) -> b(b(b(x1)))
, b(x1) -> c(c(d(x1)))
, c(x1) -> d(d(d(x1)))
, b(c(x1)) -> c(b(x1))
, b(c(d(x1))) -> a(x1)}
Details:
We have computed the following set of weak (innermost) dependency pairs:
{ a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, b^#(x1) -> c_1(c^#(c(d(x1))))
, c^#(x1) -> c_2()
, b^#(c(x1)) -> c_3(c^#(b(x1)))
, b^#(c(d(x1))) -> c_4(a^#(x1))}
The usable rules are:
{ b(x1) -> c(c(d(x1)))
, c(x1) -> d(d(d(x1)))
, b(c(x1)) -> c(b(x1))
, b(c(d(x1))) -> a(x1)
, a(a(x1)) -> b(b(b(x1)))}
The estimated dependency graph contains the following edges:
{a^#(a(x1)) -> c_0(b^#(b(b(x1))))}
==> {b^#(c(d(x1))) -> c_4(a^#(x1))}
{a^#(a(x1)) -> c_0(b^#(b(b(x1))))}
==> {b^#(c(x1)) -> c_3(c^#(b(x1)))}
{a^#(a(x1)) -> c_0(b^#(b(b(x1))))}
==> {b^#(x1) -> c_1(c^#(c(d(x1))))}
{b^#(x1) -> c_1(c^#(c(d(x1))))}
==> {c^#(x1) -> c_2()}
{b^#(c(x1)) -> c_3(c^#(b(x1)))}
==> {c^#(x1) -> c_2()}
{b^#(c(d(x1))) -> c_4(a^#(x1))}
==> {a^#(a(x1)) -> c_0(b^#(b(b(x1))))}
We consider the following path(s):
1) { a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b^#(x1) -> c_1(c^#(c(d(x1))))
, c^#(x1) -> c_2()}
The usable rules for this path are the following:
{ b(x1) -> c(c(d(x1)))
, c(x1) -> d(d(d(x1)))
, b(c(x1)) -> c(b(x1))
, b(c(d(x1))) -> a(x1)
, a(a(x1)) -> b(b(b(x1)))}
We have applied the subprocessor on the union of usable rules and weak (innermost) dependency pairs.
'Weight Gap Principle'
----------------------
Answer: YES(?,O(n^1))
Input Problem: innermost runtime-complexity with respect to
Rules:
{ b(x1) -> c(c(d(x1)))
, c(x1) -> d(d(d(x1)))
, b(c(x1)) -> c(b(x1))
, b(c(d(x1))) -> a(x1)
, a(a(x1)) -> b(b(b(x1)))
, b^#(x1) -> c_1(c^#(c(d(x1))))
, a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, c^#(x1) -> c_2()}
Details:
We apply the weight gap principle, strictly orienting the rules
{ b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
and weakly orienting the rules
{}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{ b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [1]
c(x1) = [1] x1 + [0]
d(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [1]
c_0(x1) = [1] x1 + [1]
b^#(x1) = [1] x1 + [0]
c_1(x1) = [1] x1 + [1]
c^#(x1) = [1] x1 + [0]
c_2() = [0]
c_3(x1) = [0] x1 + [0]
c_4(x1) = [1] x1 + [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{ b^#(x1) -> c_1(c^#(c(d(x1))))
, b^#(c(d(x1))) -> c_4(a^#(x1))}
and weakly orienting the rules
{ b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{ b^#(x1) -> c_1(c^#(c(d(x1))))
, b^#(c(d(x1))) -> c_4(a^#(x1))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [1]
c(x1) = [1] x1 + [0]
d(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [1]
c_0(x1) = [1] x1 + [0]
b^#(x1) = [1] x1 + [8]
c_1(x1) = [1] x1 + [1]
c^#(x1) = [1] x1 + [0]
c_2() = [0]
c_3(x1) = [0] x1 + [0]
c_4(x1) = [1] x1 + [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{c^#(x1) -> c_2()}
and weakly orienting the rules
{ b^#(x1) -> c_1(c^#(c(d(x1))))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{c^#(x1) -> c_2()}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [1]
c(x1) = [1] x1 + [0]
d(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [1]
c_0(x1) = [1] x1 + [1]
b^#(x1) = [1] x1 + [8]
c_1(x1) = [1] x1 + [0]
c^#(x1) = [1] x1 + [8]
c_2() = [0]
c_3(x1) = [0] x1 + [0]
c_4(x1) = [1] x1 + [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{c(x1) -> d(d(d(x1)))}
and weakly orienting the rules
{ c^#(x1) -> c_2()
, b^#(x1) -> c_1(c^#(c(d(x1))))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{c(x1) -> d(d(d(x1)))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [8]
c(x1) = [1] x1 + [4]
d(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [1]
c_0(x1) = [1] x1 + [1]
b^#(x1) = [1] x1 + [12]
c_1(x1) = [1] x1 + [1]
c^#(x1) = [1] x1 + [0]
c_2() = [0]
c_3(x1) = [0] x1 + [0]
c_4(x1) = [1] x1 + [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{a(a(x1)) -> b(b(b(x1)))}
and weakly orienting the rules
{ c(x1) -> d(d(d(x1)))
, c^#(x1) -> c_2()
, b^#(x1) -> c_1(c^#(c(d(x1))))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{a(a(x1)) -> b(b(b(x1)))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [14]
b(x1) = [1] x1 + [9]
c(x1) = [1] x1 + [4]
d(x1) = [1] x1 + [1]
a^#(x1) = [1] x1 + [1]
c_0(x1) = [1] x1 + [9]
b^#(x1) = [1] x1 + [12]
c_1(x1) = [1] x1 + [0]
c^#(x1) = [1] x1 + [0]
c_2() = [0]
c_3(x1) = [0] x1 + [0]
c_4(x1) = [1] x1 + [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{a^#(a(x1)) -> c_0(b^#(b(b(x1))))}
and weakly orienting the rules
{ a(a(x1)) -> b(b(b(x1)))
, c(x1) -> d(d(d(x1)))
, c^#(x1) -> c_2()
, b^#(x1) -> c_1(c^#(c(d(x1))))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{a^#(a(x1)) -> c_0(b^#(b(b(x1))))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [14]
b(x1) = [1] x1 + [9]
c(x1) = [1] x1 + [4]
d(x1) = [1] x1 + [1]
a^#(x1) = [1] x1 + [10]
c_0(x1) = [1] x1 + [0]
b^#(x1) = [1] x1 + [5]
c_1(x1) = [1] x1 + [0]
c^#(x1) = [1] x1 + [0]
c_2() = [0]
c_3(x1) = [0] x1 + [0]
c_4(x1) = [1] x1 + [0]
Finally we apply the subprocessor
'fastest of 'combine', 'Bounds with default enrichment', 'Bounds with default enrichment''
------------------------------------------------------------------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {b(c(x1)) -> c(b(x1))}
Weak Rules:
{ a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, a(a(x1)) -> b(b(b(x1)))
, c(x1) -> d(d(d(x1)))
, c^#(x1) -> c_2()
, b^#(x1) -> c_1(c^#(c(d(x1))))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
Details:
The problem was solved by processor 'Bounds with default enrichment':
'Bounds with default enrichment'
--------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {b(c(x1)) -> c(b(x1))}
Weak Rules:
{ a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, a(a(x1)) -> b(b(b(x1)))
, c(x1) -> d(d(d(x1)))
, c^#(x1) -> c_2()
, b^#(x1) -> c_1(c^#(c(d(x1))))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
Details:
The problem is Match-bounded by 0.
The enriched problem is compatible with the following automaton:
{ c_0(4) -> 11
, d_0(4) -> 4
, d_0(4) -> 11
, a^#_0(4) -> 5
, b^#_0(4) -> 7
, c_1_0(10) -> 7
, c^#_0(4) -> 9
, c^#_0(11) -> 10
, c_2_0() -> 9
, c_2_0() -> 10}
2) { a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b^#(c(x1)) -> c_3(c^#(b(x1)))
, c^#(x1) -> c_2()}
The usable rules for this path are the following:
{ b(x1) -> c(c(d(x1)))
, b(c(x1)) -> c(b(x1))
, b(c(d(x1))) -> a(x1)
, c(x1) -> d(d(d(x1)))
, a(a(x1)) -> b(b(b(x1)))}
We have applied the subprocessor on the union of usable rules and weak (innermost) dependency pairs.
'Weight Gap Principle'
----------------------
Answer: YES(?,O(n^1))
Input Problem: innermost runtime-complexity with respect to
Rules:
{ b(x1) -> c(c(d(x1)))
, b(c(x1)) -> c(b(x1))
, b(c(d(x1))) -> a(x1)
, c(x1) -> d(d(d(x1)))
, a(a(x1)) -> b(b(b(x1)))
, b^#(c(x1)) -> c_3(c^#(b(x1)))
, a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, c^#(x1) -> c_2()}
Details:
We apply the weight gap principle, strictly orienting the rules
{ b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
and weakly orienting the rules
{}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{ b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [1]
c(x1) = [1] x1 + [0]
d(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [1]
c_0(x1) = [1] x1 + [0]
b^#(x1) = [1] x1 + [1]
c_1(x1) = [0] x1 + [0]
c^#(x1) = [1] x1 + [0]
c_2() = [0]
c_3(x1) = [1] x1 + [0]
c_4(x1) = [1] x1 + [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{a^#(a(x1)) -> c_0(b^#(b(b(x1))))}
and weakly orienting the rules
{ b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{a^#(a(x1)) -> c_0(b^#(b(b(x1))))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [1]
c(x1) = [1] x1 + [0]
d(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [9]
c_0(x1) = [1] x1 + [0]
b^#(x1) = [1] x1 + [1]
c_1(x1) = [0] x1 + [0]
c^#(x1) = [1] x1 + [0]
c_2() = [0]
c_3(x1) = [1] x1 + [0]
c_4(x1) = [1] x1 + [8]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{c^#(x1) -> c_2()}
and weakly orienting the rules
{ a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{c^#(x1) -> c_2()}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [1]
c(x1) = [1] x1 + [0]
d(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [3]
c_0(x1) = [1] x1 + [0]
b^#(x1) = [1] x1 + [1]
c_1(x1) = [0] x1 + [0]
c^#(x1) = [1] x1 + [8]
c_2() = [0]
c_3(x1) = [1] x1 + [0]
c_4(x1) = [1] x1 + [2]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{b^#(c(x1)) -> c_3(c^#(b(x1)))}
and weakly orienting the rules
{ c^#(x1) -> c_2()
, a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{b^#(c(x1)) -> c_3(c^#(b(x1)))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [1]
c(x1) = [1] x1 + [0]
d(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [11]
c_0(x1) = [1] x1 + [0]
b^#(x1) = [1] x1 + [9]
c_1(x1) = [0] x1 + [0]
c^#(x1) = [1] x1 + [0]
c_2() = [0]
c_3(x1) = [1] x1 + [0]
c_4(x1) = [1] x1 + [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{ a(a(x1)) -> b(b(b(x1)))
, b^#(c(d(x1))) -> c_4(a^#(x1))}
and weakly orienting the rules
{ b^#(c(x1)) -> c_3(c^#(b(x1)))
, c^#(x1) -> c_2()
, a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{ a(a(x1)) -> b(b(b(x1)))
, b^#(c(d(x1))) -> c_4(a^#(x1))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [2]
b(x1) = [1] x1 + [1]
c(x1) = [1] x1 + [0]
d(x1) = [1] x1 + [1]
a^#(x1) = [1] x1 + [1]
c_0(x1) = [1] x1 + [0]
b^#(x1) = [1] x1 + [1]
c_1(x1) = [0] x1 + [0]
c^#(x1) = [1] x1 + [0]
c_2() = [0]
c_3(x1) = [1] x1 + [0]
c_4(x1) = [1] x1 + [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{c(x1) -> d(d(d(x1)))}
and weakly orienting the rules
{ a(a(x1)) -> b(b(b(x1)))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b^#(c(x1)) -> c_3(c^#(b(x1)))
, c^#(x1) -> c_2()
, a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{c(x1) -> d(d(d(x1)))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [3]
b(x1) = [1] x1 + [2]
c(x1) = [1] x1 + [1]
d(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [2]
c_0(x1) = [1] x1 + [0]
b^#(x1) = [1] x1 + [1]
c_1(x1) = [0] x1 + [0]
c^#(x1) = [1] x1 + [0]
c_2() = [0]
c_3(x1) = [1] x1 + [0]
c_4(x1) = [1] x1 + [0]
Finally we apply the subprocessor
'fastest of 'combine', 'Bounds with default enrichment', 'Bounds with default enrichment''
------------------------------------------------------------------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {b(c(x1)) -> c(b(x1))}
Weak Rules:
{ c(x1) -> d(d(d(x1)))
, a(a(x1)) -> b(b(b(x1)))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b^#(c(x1)) -> c_3(c^#(b(x1)))
, c^#(x1) -> c_2()
, a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
Details:
The problem was solved by processor 'Bounds with default enrichment':
'Bounds with default enrichment'
--------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {b(c(x1)) -> c(b(x1))}
Weak Rules:
{ c(x1) -> d(d(d(x1)))
, a(a(x1)) -> b(b(b(x1)))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b^#(c(x1)) -> c_3(c^#(b(x1)))
, c^#(x1) -> c_2()
, a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
Details:
The problem is Match-bounded by 0.
The enriched problem is compatible with the following automaton:
{ d_0(4) -> 4
, a^#_0(4) -> 5
, b^#_0(4) -> 7
, c^#_0(4) -> 9
, c_2_0() -> 9}
3) { a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b^#(x1) -> c_1(c^#(c(d(x1))))}
The usable rules for this path are the following:
{ b(x1) -> c(c(d(x1)))
, c(x1) -> d(d(d(x1)))
, b(c(x1)) -> c(b(x1))
, b(c(d(x1))) -> a(x1)
, a(a(x1)) -> b(b(b(x1)))}
We have applied the subprocessor on the union of usable rules and weak (innermost) dependency pairs.
'Weight Gap Principle'
----------------------
Answer: YES(?,O(n^1))
Input Problem: innermost runtime-complexity with respect to
Rules:
{ b(x1) -> c(c(d(x1)))
, c(x1) -> d(d(d(x1)))
, b(c(x1)) -> c(b(x1))
, b(c(d(x1))) -> a(x1)
, a(a(x1)) -> b(b(b(x1)))
, a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b^#(x1) -> c_1(c^#(c(d(x1))))}
Details:
We apply the weight gap principle, strictly orienting the rules
{ b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
and weakly orienting the rules
{}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{ b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [1]
c(x1) = [1] x1 + [0]
d(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [1]
c_0(x1) = [1] x1 + [1]
b^#(x1) = [1] x1 + [0]
c_1(x1) = [1] x1 + [1]
c^#(x1) = [1] x1 + [0]
c_2() = [0]
c_3(x1) = [0] x1 + [0]
c_4(x1) = [1] x1 + [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{ b^#(c(d(x1))) -> c_4(a^#(x1))
, b^#(x1) -> c_1(c^#(c(d(x1))))}
and weakly orienting the rules
{ b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{ b^#(c(d(x1))) -> c_4(a^#(x1))
, b^#(x1) -> c_1(c^#(c(d(x1))))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [1]
c(x1) = [1] x1 + [0]
d(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [1]
c_0(x1) = [1] x1 + [1]
b^#(x1) = [1] x1 + [8]
c_1(x1) = [1] x1 + [1]
c^#(x1) = [1] x1 + [0]
c_2() = [0]
c_3(x1) = [0] x1 + [0]
c_4(x1) = [1] x1 + [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{c(x1) -> d(d(d(x1)))}
and weakly orienting the rules
{ b^#(c(d(x1))) -> c_4(a^#(x1))
, b^#(x1) -> c_1(c^#(c(d(x1))))
, b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{c(x1) -> d(d(d(x1)))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [8]
c(x1) = [1] x1 + [2]
d(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [1]
c_0(x1) = [1] x1 + [0]
b^#(x1) = [1] x1 + [14]
c_1(x1) = [1] x1 + [3]
c^#(x1) = [1] x1 + [7]
c_2() = [0]
c_3(x1) = [0] x1 + [0]
c_4(x1) = [1] x1 + [1]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{a(a(x1)) -> b(b(b(x1)))}
and weakly orienting the rules
{ c(x1) -> d(d(d(x1)))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b^#(x1) -> c_1(c^#(c(d(x1))))
, b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{a(a(x1)) -> b(b(b(x1)))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [14]
b(x1) = [1] x1 + [9]
c(x1) = [1] x1 + [4]
d(x1) = [1] x1 + [1]
a^#(x1) = [1] x1 + [0]
c_0(x1) = [1] x1 + [0]
b^#(x1) = [1] x1 + [9]
c_1(x1) = [1] x1 + [0]
c^#(x1) = [1] x1 + [4]
c_2() = [0]
c_3(x1) = [0] x1 + [0]
c_4(x1) = [1] x1 + [1]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{a^#(a(x1)) -> c_0(b^#(b(b(x1))))}
and weakly orienting the rules
{ a(a(x1)) -> b(b(b(x1)))
, c(x1) -> d(d(d(x1)))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b^#(x1) -> c_1(c^#(c(d(x1))))
, b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{a^#(a(x1)) -> c_0(b^#(b(b(x1))))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [11]
b(x1) = [1] x1 + [7]
c(x1) = [1] x1 + [3]
d(x1) = [1] x1 + [1]
a^#(x1) = [1] x1 + [8]
c_0(x1) = [1] x1 + [0]
b^#(x1) = [1] x1 + [4]
c_1(x1) = [1] x1 + [0]
c^#(x1) = [1] x1 + [0]
c_2() = [0]
c_3(x1) = [0] x1 + [0]
c_4(x1) = [1] x1 + [0]
Finally we apply the subprocessor
'fastest of 'combine', 'Bounds with default enrichment', 'Bounds with default enrichment''
------------------------------------------------------------------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {b(c(x1)) -> c(b(x1))}
Weak Rules:
{ a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, a(a(x1)) -> b(b(b(x1)))
, c(x1) -> d(d(d(x1)))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b^#(x1) -> c_1(c^#(c(d(x1))))
, b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
Details:
The problem was solved by processor 'Bounds with default enrichment':
'Bounds with default enrichment'
--------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {b(c(x1)) -> c(b(x1))}
Weak Rules:
{ a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, a(a(x1)) -> b(b(b(x1)))
, c(x1) -> d(d(d(x1)))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b^#(x1) -> c_1(c^#(c(d(x1))))
, b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
Details:
The problem is Match-bounded by 0.
The enriched problem is compatible with the following automaton:
{ c_0(4) -> 11
, d_0(4) -> 4
, d_0(4) -> 11
, a^#_0(4) -> 5
, b^#_0(4) -> 7
, c_1_0(10) -> 7
, c^#_0(4) -> 9
, c^#_0(11) -> 10}
4) { a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, b^#(c(d(x1))) -> c_4(a^#(x1))}
The usable rules for this path are the following:
{ b(x1) -> c(c(d(x1)))
, b(c(x1)) -> c(b(x1))
, b(c(d(x1))) -> a(x1)
, c(x1) -> d(d(d(x1)))
, a(a(x1)) -> b(b(b(x1)))}
We have applied the subprocessor on the union of usable rules and weak (innermost) dependency pairs.
'Weight Gap Principle'
----------------------
Answer: YES(?,O(n^1))
Input Problem: innermost runtime-complexity with respect to
Rules:
{ b(x1) -> c(c(d(x1)))
, b(c(x1)) -> c(b(x1))
, b(c(d(x1))) -> a(x1)
, c(x1) -> d(d(d(x1)))
, a(a(x1)) -> b(b(b(x1)))
, a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, b^#(c(d(x1))) -> c_4(a^#(x1))}
Details:
We apply the weight gap principle, strictly orienting the rules
{ b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
and weakly orienting the rules
{}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{ b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [1]
c(x1) = [1] x1 + [0]
d(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [1]
c_0(x1) = [1] x1 + [1]
b^#(x1) = [1] x1 + [0]
c_1(x1) = [0] x1 + [0]
c^#(x1) = [0] x1 + [0]
c_2() = [0]
c_3(x1) = [0] x1 + [0]
c_4(x1) = [1] x1 + [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{b^#(c(d(x1))) -> c_4(a^#(x1))}
and weakly orienting the rules
{ b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{b^#(c(d(x1))) -> c_4(a^#(x1))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [0]
b(x1) = [1] x1 + [1]
c(x1) = [1] x1 + [0]
d(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [1]
c_0(x1) = [1] x1 + [3]
b^#(x1) = [1] x1 + [8]
c_1(x1) = [0] x1 + [0]
c^#(x1) = [0] x1 + [0]
c_2() = [0]
c_3(x1) = [0] x1 + [0]
c_4(x1) = [1] x1 + [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{a(a(x1)) -> b(b(b(x1)))}
and weakly orienting the rules
{ b^#(c(d(x1))) -> c_4(a^#(x1))
, b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{a(a(x1)) -> b(b(b(x1)))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [2]
b(x1) = [1] x1 + [1]
c(x1) = [1] x1 + [0]
d(x1) = [1] x1 + [1]
a^#(x1) = [1] x1 + [1]
c_0(x1) = [1] x1 + [8]
b^#(x1) = [1] x1 + [11]
c_1(x1) = [0] x1 + [0]
c^#(x1) = [0] x1 + [0]
c_2() = [0]
c_3(x1) = [0] x1 + [0]
c_4(x1) = [1] x1 + [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{a^#(a(x1)) -> c_0(b^#(b(b(x1))))}
and weakly orienting the rules
{ a(a(x1)) -> b(b(b(x1)))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{a^#(a(x1)) -> c_0(b^#(b(b(x1))))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [2]
b(x1) = [1] x1 + [1]
c(x1) = [1] x1 + [0]
d(x1) = [1] x1 + [1]
a^#(x1) = [1] x1 + [1]
c_0(x1) = [1] x1 + [0]
b^#(x1) = [1] x1 + [0]
c_1(x1) = [0] x1 + [0]
c^#(x1) = [0] x1 + [0]
c_2() = [0]
c_3(x1) = [0] x1 + [0]
c_4(x1) = [1] x1 + [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{c(x1) -> d(d(d(x1)))}
and weakly orienting the rules
{ a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, a(a(x1)) -> b(b(b(x1)))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{c(x1) -> d(d(d(x1)))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [12]
b(x1) = [1] x1 + [8]
c(x1) = [1] x1 + [4]
d(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [4]
c_0(x1) = [1] x1 + [0]
b^#(x1) = [1] x1 + [0]
c_1(x1) = [0] x1 + [0]
c^#(x1) = [0] x1 + [0]
c_2() = [0]
c_3(x1) = [0] x1 + [0]
c_4(x1) = [1] x1 + [0]
Finally we apply the subprocessor
'fastest of 'combine', 'Bounds with default enrichment', 'Bounds with default enrichment''
------------------------------------------------------------------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {b(c(x1)) -> c(b(x1))}
Weak Rules:
{ c(x1) -> d(d(d(x1)))
, a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, a(a(x1)) -> b(b(b(x1)))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
Details:
The problem was solved by processor 'Bounds with default enrichment':
'Bounds with default enrichment'
--------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {b(c(x1)) -> c(b(x1))}
Weak Rules:
{ c(x1) -> d(d(d(x1)))
, a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, a(a(x1)) -> b(b(b(x1)))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b(x1) -> c(c(d(x1)))
, b(c(d(x1))) -> a(x1)}
Details:
The problem is Match-bounded by 0.
The enriched problem is compatible with the following automaton:
{ d_0(4) -> 4
, a^#_0(4) -> 5
, b^#_0(4) -> 7}
5) { a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b^#(c(x1)) -> c_3(c^#(b(x1)))}
The usable rules for this path are the following:
{ b(x1) -> c(c(d(x1)))
, b(c(x1)) -> c(b(x1))
, b(c(d(x1))) -> a(x1)
, c(x1) -> d(d(d(x1)))
, a(a(x1)) -> b(b(b(x1)))}
We have applied the subprocessor on the union of usable rules and weak (innermost) dependency pairs.
'Weight Gap Principle'
----------------------
Answer: YES(?,O(n^1))
Input Problem: innermost runtime-complexity with respect to
Rules:
{ b(x1) -> c(c(d(x1)))
, b(c(x1)) -> c(b(x1))
, b(c(d(x1))) -> a(x1)
, c(x1) -> d(d(d(x1)))
, a(a(x1)) -> b(b(b(x1)))
, a^#(a(x1)) -> c_0(b^#(b(b(x1))))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b^#(c(x1)) -> c_3(c^#(b(x1)))}
Details:
We apply the weight gap principle, strictly orienting the rules
{ b(x1) -> c(c(d(x1)))
, a(a(x1)) -> b(b(b(x1)))
, a^#(a(x1)) -> c_0(b^#(b(b(x1))))}
and weakly orienting the rules
{}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{ b(x1) -> c(c(d(x1)))
, a(a(x1)) -> b(b(b(x1)))
, a^#(a(x1)) -> c_0(b^#(b(b(x1))))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [4]
b(x1) = [1] x1 + [1]
c(x1) = [1] x1 + [0]
d(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [1]
c_0(x1) = [1] x1 + [1]
b^#(x1) = [1] x1 + [0]
c_1(x1) = [0] x1 + [0]
c^#(x1) = [1] x1 + [1]
c_2() = [0]
c_3(x1) = [1] x1 + [1]
c_4(x1) = [1] x1 + [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{b^#(c(d(x1))) -> c_4(a^#(x1))}
and weakly orienting the rules
{ b(x1) -> c(c(d(x1)))
, a(a(x1)) -> b(b(b(x1)))
, a^#(a(x1)) -> c_0(b^#(b(b(x1))))}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{b^#(c(d(x1))) -> c_4(a^#(x1))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [9]
b(x1) = [1] x1 + [1]
c(x1) = [1] x1 + [0]
d(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [0]
c_0(x1) = [1] x1 + [0]
b^#(x1) = [1] x1 + [1]
c_1(x1) = [0] x1 + [0]
c^#(x1) = [1] x1 + [0]
c_2() = [0]
c_3(x1) = [1] x1 + [0]
c_4(x1) = [1] x1 + [0]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{ b(c(d(x1))) -> a(x1)
, b^#(c(x1)) -> c_3(c^#(b(x1)))}
and weakly orienting the rules
{ b^#(c(d(x1))) -> c_4(a^#(x1))
, b(x1) -> c(c(d(x1)))
, a(a(x1)) -> b(b(b(x1)))
, a^#(a(x1)) -> c_0(b^#(b(b(x1))))}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{ b(c(d(x1))) -> a(x1)
, b^#(c(x1)) -> c_3(c^#(b(x1)))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [12]
b(x1) = [1] x1 + [8]
c(x1) = [1] x1 + [0]
d(x1) = [1] x1 + [5]
a^#(x1) = [1] x1 + [14]
c_0(x1) = [1] x1 + [0]
b^#(x1) = [1] x1 + [10]
c_1(x1) = [0] x1 + [0]
c^#(x1) = [1] x1 + [1]
c_2() = [0]
c_3(x1) = [1] x1 + [0]
c_4(x1) = [1] x1 + [1]
Finally we apply the subprocessor
We apply the weight gap principle, strictly orienting the rules
{c(x1) -> d(d(d(x1)))}
and weakly orienting the rules
{ b(c(d(x1))) -> a(x1)
, b^#(c(x1)) -> c_3(c^#(b(x1)))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b(x1) -> c(c(d(x1)))
, a(a(x1)) -> b(b(b(x1)))
, a^#(a(x1)) -> c_0(b^#(b(b(x1))))}
using the following strongly linear interpretation:
Processor 'Matrix Interpretation' oriented the following rules strictly:
{c(x1) -> d(d(d(x1)))}
Details:
Interpretation Functions:
a(x1) = [1] x1 + [3]
b(x1) = [1] x1 + [2]
c(x1) = [1] x1 + [1]
d(x1) = [1] x1 + [0]
a^#(x1) = [1] x1 + [10]
c_0(x1) = [1] x1 + [0]
b^#(x1) = [1] x1 + [9]
c_1(x1) = [0] x1 + [0]
c^#(x1) = [1] x1 + [3]
c_2() = [0]
c_3(x1) = [1] x1 + [0]
c_4(x1) = [1] x1 + [0]
Finally we apply the subprocessor
'fastest of 'combine', 'Bounds with default enrichment', 'Bounds with default enrichment''
------------------------------------------------------------------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {b(c(x1)) -> c(b(x1))}
Weak Rules:
{ c(x1) -> d(d(d(x1)))
, b(c(d(x1))) -> a(x1)
, b^#(c(x1)) -> c_3(c^#(b(x1)))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b(x1) -> c(c(d(x1)))
, a(a(x1)) -> b(b(b(x1)))
, a^#(a(x1)) -> c_0(b^#(b(b(x1))))}
Details:
The problem was solved by processor 'Bounds with default enrichment':
'Bounds with default enrichment'
--------------------------------
Answer: YES(?,O(n^1))
Input Problem: innermost relative runtime-complexity with respect to
Strict Rules: {b(c(x1)) -> c(b(x1))}
Weak Rules:
{ c(x1) -> d(d(d(x1)))
, b(c(d(x1))) -> a(x1)
, b^#(c(x1)) -> c_3(c^#(b(x1)))
, b^#(c(d(x1))) -> c_4(a^#(x1))
, b(x1) -> c(c(d(x1)))
, a(a(x1)) -> b(b(b(x1)))
, a^#(a(x1)) -> c_0(b^#(b(b(x1))))}
Details:
The problem is Match-bounded by 0.
The enriched problem is compatible with the following automaton:
{ d_0(4) -> 4
, a^#_0(4) -> 5
, b^#_0(4) -> 7
, c^#_0(4) -> 9}